21![Counting Eulerian Circuits is #P-Complete Graham R. Brightwell Abstract We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is mod Counting Eulerian Circuits is #P-Complete Graham R. Brightwell Abstract We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is mod](https://www.pdfsearch.io/img/4368b00dc3f746b5259f9cc632620760.jpg) | Add to Reading ListSource URL: www.siam.orgLanguage: English - Date: 2005-07-06 08:19:12
|
---|
22![´ Quebec, ´ CCCG 2008, Montreal, August 13–15, 2008 Computational Balloon Twisting: ´ Quebec, ´ CCCG 2008, Montreal, August 13–15, 2008 Computational Balloon Twisting:](https://www.pdfsearch.io/img/0f996929ffda8ead9521a59f1fadd432.jpg) | Add to Reading ListSource URL: cccg.caLanguage: English - Date: 2008-10-29 00:01:20
|
---|
23![arXiv:1107.1052v1 [cs.DS] 6 JulThe traveling salesman problem on cubic and subcubic graphs∗ Sylvia Boyd† arXiv:1107.1052v1 [cs.DS] 6 JulThe traveling salesman problem on cubic and subcubic graphs∗ Sylvia Boyd†](https://www.pdfsearch.io/img/ceaf448acf0b47624173aad0d5b6427d.jpg) | Add to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2011-07-06 20:12:57
|
---|
24![Longest Paths in Planar DAGs in Unambiguous Log-Space∗ Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar The Institute of Mathematical Sciences, Chennai, India. Email: {nutan,meena,prajakta}@imsc.res.in 13 Novem Longest Paths in Planar DAGs in Unambiguous Log-Space∗ Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar The Institute of Mathematical Sciences, Chennai, India. Email: {nutan,meena,prajakta}@imsc.res.in 13 Novem](https://www.pdfsearch.io/img/a79ea07dbad7a546bad5bc8ad5971f28.jpg) | Add to Reading ListSource URL: cjtcs.cs.uchicago.eduLanguage: English - Date: 2011-06-03 17:31:15
|
---|
25![Eindhoven Honours Class Foundations of Informatics Algorithmic Adventures Eindhoven Honours Class Foundations of Informatics Algorithmic Adventures](https://www.pdfsearch.io/img/e4127d0b57b6b0078d7a836a5b5b2307.jpg) | Add to Reading ListSource URL: www.win.tue.nlLanguage: English - Date: 2010-12-13 10:02:09
|
---|
26![Approximation Hardness of Graphic TSP on Cubic Graphs Marek Karpinski∗ Richard Schmied† Approximation Hardness of Graphic TSP on Cubic Graphs Marek Karpinski∗ Richard Schmied†](https://www.pdfsearch.io/img/191c8c2c5a13df9ec3dfe7ddd54ab346.jpg) | Add to Reading ListSource URL: theory.cs.uni-bonn.deLanguage: English - Date: 2013-04-25 00:45:46
|
---|
27![Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study Jeremy Franky and Ian P. Gentz and Toby Walshz August 15, 1997 analysis of algorithms, computational complexity, phase tra Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study Jeremy Franky and Ian P. Gentz and Toby Walshz August 15, 1997 analysis of algorithms, computational complexity, phase tra](https://www.pdfsearch.io/img/c6a171c2df86264c9033f73aee9b20f4.jpg) | Add to Reading ListSource URL: www.cse.unsw.edu.auLanguage: English - Date: 2013-07-29 02:03:45
|
---|
28![Chapter 3 Reconstructing DNA 3.1 Introduction Chapter 3 Reconstructing DNA 3.1 Introduction](https://www.pdfsearch.io/img/2fa78857f6d571cc23318e9b26ae4cc8.jpg) | Add to Reading ListSource URL: www.liacs.nlLanguage: English - Date: 2009-07-03 16:04:35
|
---|
29![9780199233212_Moore_&_Mertens.pdf 9780199233212_Moore_&_Mertens.pdf](https://www.pdfsearch.io/img/ce772e847b723d00411b183f4cefdf07.jpg) | Add to Reading ListSource URL: fdslive.oup.comLanguage: English - Date: 2013-09-30 10:01:30
|
---|
30![Network theory / NP-complete problems / Shortest path problem / Hamiltonian path / Eulerian path / Distance / Graph / Petersen graph / Widest path problem / Graph theory / Mathematics / Theoretical computer science Network theory / NP-complete problems / Shortest path problem / Hamiltonian path / Eulerian path / Distance / Graph / Petersen graph / Widest path problem / Graph theory / Mathematics / Theoretical computer science](/pdf-icon.png) | Add to Reading ListSource URL: www.tryengineering.orgLanguage: English - Date: 2013-12-09 20:23:19
|
---|